Tuple Space Coordination Across Space & Time
نویسندگان
چکیده
CAST is a coordination model designed to support interactions among agents executing on hosts that make up a mobile ad hoc network (MANET). From an application programmer’s point of view, CAST makes it possible for operations to be executed at arbitrary locations in space, at prescribed times which may be in the future, and on remote hosts even when no end-to-end connected route exists between the initiator and target(s) of the operation. To accomplish this, CAST assumes that each host moves in space in accordance with a motion profile which is accurate but which at any given time extends into the future for a limited duration. These motion profiles are freely exchanged among hosts in the network through a gossiping protocol. Knowledge about the motion profiles of the other hosts in the network allows for source routing of operation requests and replies over disconnected routes. In this paper, we present the CAST model and its formalization. We also discuss the feasibility of realizing this model. Type of Report: Other Department of Computer Science & Engineering Washington University in St. Louis Campus Box 1045 St. Louis, MO 63130 ph: (314) 935-6160 Tuple Space Coordination Across Space & Time Gruia-Catalin Roman, Radu Handorean, and Rohan Sen 1 Department of Computer Science and Engineering Washington University in St. Louis Campus Box 1045, One Brookings Drive St. Louis, MO 63130-4899, USA 2 Qualcomm Inc. 6180 Spine Road, Boulder, CO 80301 Abstract. CAST is a coordination model designed to support interactions among agents executing on hosts that make up a mobile ad hoc network (MANET). From an application programmer’s point of view, CAST makes it possible for operations to be executed at arbitrary locations in space, at prescribed times which may be in the future, and on remote hosts even when no end-to-end connected route exists between the initiator and target(s) of the operation. To accomplish this, CAST assumes that each host moves in space in accordance with a motion profile which is accurate but which at any given time extends into the future for a limited duration. These motion profiles are freely exchanged among hosts in the network through a gossiping protocol. Knowledge about the motion profiles of the other hosts in the network allows for source routing of operation requests and replies over disconnected routes. In this paper, we present the CAST model and its formalization. We also discuss the feasibility of realizing this model. CAST is a coordination model designed to support interactions among agents executing on hosts that make up a mobile ad hoc network (MANET). From an application programmer’s point of view, CAST makes it possible for operations to be executed at arbitrary locations in space, at prescribed times which may be in the future, and on remote hosts even when no end-to-end connected route exists between the initiator and target(s) of the operation. To accomplish this, CAST assumes that each host moves in space in accordance with a motion profile which is accurate but which at any given time extends into the future for a limited duration. These motion profiles are freely exchanged among hosts in the network through a gossiping protocol. Knowledge about the motion profiles of the other hosts in the network allows for source routing of operation requests and replies over disconnected routes. In this paper, we present the CAST model and its formalization. We also discuss the feasibility of realizing this model.
منابع مشابه
Brief Announcement: Decoupled Quorum-Based Byzantine-Resilient Coordination in Open Distributed Systems
The tuple space coordination model, originally introduced in the Linda programming language [2], uses a shared memory object called a tuple space to support coordination that is decoupled both in time – processes do not have to be active at the same time – and space – processes do not need to know each others’ addresses. The tuple space can be considered to be a kind of storage that stores tupl...
متن کاملLinda in Space-Time: An Adaptive Coordination Model for Mobile Ad-Hoc Environments
We present a vision of distributed system coordination as a set of activities affecting the space-time fabric of interaction events. In the tuple space setting that we consider, coordination amounts to control of the spatial and temporal configuration of tuples spread across the network, which in turn drives the behaviour of situated agents. We therefore draw on prior work in spatial computing ...
متن کاملA Stable Distributed Tuple Space
An approach is presented which extends the MOMfaulttolerant implementation of the Linda model of parallel programming. The original MOM system provided persistence of tuples and tuple states across both tuplespace and worker node halt failures. Unfortunately, the requirement that system tuple space reside in a central location restricted the scalability of the MOM model. In this work, an approa...
متن کاملAn Efficient Tuple Space Programming Environment
An E cient Tuple Space Programming Environment Introduction Tuple Space Programming Fundamentals Example Linda Program Associative Memory Analysis Compilation Environment Basic Translation Optimizing Compilers Run time Environment Processor Location of Data Data Structures for E cient Data Access Data Transfer Protocol Process Creation Cluster Execution Environment Run time Optimizations Extens...
متن کاملProving the Correctness of Optimising Destructive and Non-destructive Reads over Tuple Spaces
In this paper we describe the proof of an optimisation that can be applied to tuple space based run-time systems (as used in Linda). The optimisation allows, under certain circumstances, for a tuple that has been destructively removed from a shared tuple space (for example, by a Linda in) to be returned as the result for a non-destructive read (for example, a Linda rd) for a di erent process. T...
متن کاملCapability-based coordination for open distributed systems
The tuple-space based model, also known as Linda, offers an alternative to the conventional point-to-point communication framework with regard to coordinating and synchronising agents’ activities. The shared data space provides a medium for communication and facilitates the coordination among the interacting agents. The clear separation between the coordination and the computation concerns reli...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2006